Complexity bounds on some fundamental computational problems for quantum branching programs
نویسنده
چکیده
منابع مشابه
On Complexity of Quantum Branching Programs Computing Equality-like Boolean Functions
We consider Generalized Equality, the Hidden Subgroup, and related problems in the context of quantum Ordered Binary Decision Diagrams. For the decision versions of considered problems we show polynomial upper bounds in terms of quantum OBDD width. We apply a new modification of the fingerprinting technique and present the algorithms in circuit notation. Our algorithms require at most logarithm...
متن کاملWorkshop on Computational, Descriptive and Proof Complexity, and Algorithms
Farid Ablayev. Classical Simulation Complexity of Bounded Error Quantum Branching Programs We present classical simulation techniques for measure once quantum branching programs. For bounded error syntactic quantum branching program of width w that computes a function with error δ we present a classical deterministic branching program of the same length and width at most (1 + 2/(1− 2δ)) that co...
متن کاملUpper and Lower Bounds for Certain Graph-Accessibility Problems on Bounded Alternating Omega-Branching Programs
In the following we investigate the computational complexity of various !-GRAPH ACCESSIBILITY PROBLEMs on the most general restricted type of !-branching programs for which, up to now, exponential lower bounds on the size can be proved. By means of exponential lower bounds on various ranks of certain communication matrices we prove that !GRAPH ACCESSIBILITY PROBLEMs can not be computed by bound...
متن کاملQuantum vs. Classical Read-Once Branching Programs
The paper presents the first nontrivial upper and lower bounds for (nonoblivious) quantum read-once branching programs. It is shown that the computational power of quantum and classical read-once branching programs is incomparable in the following sense: (i) A simple, explicit boolean function on 2n input bits is presented that is computable by error-free quantum read-once branching programs of...
متن کاملComplexity of restricted and unrestricted models of molecular computation
In [9] and [2] a formal model for molecular computing was proposed, which makes focused use of affinity purification. The use of PCR was suggested to expand the range of feasible computations, resulting in a second model. In this note, we give a precise characterization of these two models in terms of recognized computational complexity classes, namely branching programs (BP) and nondeterminist...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005